The Gröbner fan and Gröbner walk for modules

نویسنده

  • Ruth L. Auerbach
چکیده

This paper extends the theory of the Gröbner fan and Gröbner walk for ideals in polynomial rings to the case of submodules of free modules over a polynomial ring. The Gröbner fan for a submodule creates a correspondence between a pair consisting of a cone in the fan and a point in the support of the cone and a pair consisting of a leading monomial submodule (or equivalently, a reduced marked Gröbner basis) and a grading of the free module over the ring that is compatible with the choice of leading monomials. The Gröbner walk is an algorithm based on the Gröbner fan that converts a given Gröbner basis to a Gröbner basis with respect to a different monomial order; the point being that the Gröbner walk can be more efficient than the standard algorithms for Gröbner basis computations with difficult monomial orders. Algorithms for generating the Gröbner fan and for the Gröbner walk are given. © 2005 Published by Elsevier Ltd

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Walking Through The Gröbner Fan

The Gröbner Walk is an algorithm that transforms a polynomial ideal’s Gröbner basis under one term order into a basis under another order. Although we could always directly compute such a basis using Buchberger’s algorithm, the Gröbner Walk is of special interest because, in many cases, it is much more efficient to convert a basis using this algorithm than to compute it directly. We first discu...

متن کامل

The generic Gröbner walk

The Gröbner walk is an algorithm for conversion between Gröbner bases for different term orders. It is based on the polyhedral geometry of the Gröbner fan and involves tracking a line between cones representing the initial and target term order. An important parameter is explicit numerical perturbation of this line. This usually involves both time and space demanding arithmetic of integers much...

متن کامل

Converting Bases with the Gröbner Walk

The objective of this note is the presentation of a procedure for converting a given Gröbner basis (Buchberger, 1965) of a polynomial ideal I to a Gröbner basis of I with respect to another term order. This procedure, which we call the Gröbner walk, is completely elementary and does not require any assumptions about the dimension or the number of variables of the ideal. The Gröbner walk breaks ...

متن کامل

A Fast Algorithm for Gröbner Basis Conversion and its Applications

The Gröbner walk method converts a Gröbner basis by partitioning the computation of the basis into several smaller computations following a path in the Gröbner fan of the ideal generated by the system of equations. The method works with ideals of zerodimension as well as positive dimension. Typically, the target point of the walking path lies on the intersection of very many cones, which ends u...

متن کامل

iv : m at h . A C / 0 50 13 45 v 3 1 3 O ct 2 00 5 The generic Gröbner walk

The Gröbner walk is an algorithm for conversion between Gröbner bases for different term orders. It is based on the polyhedral geometry of the Gröbner fan and involves tracking a line between cones representing the initial and target term order. An important parameter is explicit numerical perturbation of this line. This usually involves both time and space demanding arithmetic of integers much...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2005